Minimal approximate hitting sets and rule templates
نویسندگان
چکیده
منابع مشابه
Computing Minimal Hitting Sets with Genetic Algorithm
A set S that has a non-empty intersection with every set in a collection of sets C is called a hitting set of C. If no element can be removed from S without violating the hitting set property, S is considered to be minimal. Several interesting problems can be partly formulated as ones that a minimal hitting set or more ones have to be found. Many of these problems are required for proper soluti...
متن کاملOptimizations for the Boolean Approach to Computing Minimal Hitting Sets
The Boolean approach to computing minimal hitting sets proposed by Lin and Jiang is known to offer very attractive general performance, but also has its issues, specifically with a cardinalityrestricted search. In this paper we propose optimizations regarding the refinement rules, also offering a revised decision strategy as well as optimized termination criteria that exploit cardinality bounds...
متن کاملAn Efficient Distributed Algorithm for Computing Minimal Hitting Sets
Computing minimal hitting sets for a collection of sets is an important problem in many domains (e.g., Spectrum-based Fault Localization). Being an NP-Hard problem, exhaustive algorithms are usually prohibitive for real-world, often large, problems. In practice, the usage of heuristic based approaches trade-off completeness for time efficiency. An example of such heuristic approaches is STACCAT...
متن کاملA Low-Cost Approximate Minimal Hitting Set Algorithm and its Application to Model-Based Diagnosis
Generating minimal hitting sets of a collection of sets is known to be NP-hard, necessitating heuristic approaches to handle large problems. In this paper a low-cost, approximate minimal hitting set (MHS) algorithm, coined STACCATO, is presented. STACCATO uses a heuristic function, borrowed from a lightweight, statistics-based software fault localization approach, to guide the MHS search. Given...
متن کاملThe Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting
A k-hitting set in a hypergraph is a set of at most k vertices that intersects all hyperedges. We study the union of all inclusion-minimal khitting sets in hypergraphs of rank r (where the rank is the maximum size of hyperedges). We show that this union is relevant for certain combinatorial inference problems and give worst-case bounds on its size, depending on r and k. For r = 2 our result is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Approximate Reasoning
سال: 2000
ISSN: 0888-613X
DOI: 10.1016/s0888-613x(00)00051-7